Context-dependent tree automata

Automata for Context-Dependent Connectors

Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, such connectors can themselves be composed, resulting in an expressive calculus of connectors whose semantics encompasses complex combinations of synchronisation, mutual exclusion, non-deterministic choice and state-dependent be...

Caterpillars, context, tree automata and tree pattern matching

We present a novel, yet simple, technique for the speciication of context in struc-tured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciication for structured documents, as we shall demonstrate, and for the speciication of ...

Restarting Tree Automata and Linear Context-Free Tree Languages

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

NEW DIRECTION IN FUZZY TREE AUTOMATA

In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...